A non‐linear and non‐local boundary condition for a diffusion equation in petroleum engineering

This article deals with a boundary value problem for Laplace equation with a non‐linear and non‐local boundary condition. This problem comes from petroleum engineering and is used to obtain an estimation of well productivity. The non‐linear and non‐local boundary condition is written on the well boundary. On the outer reservoir boundaries, we have both Dirichlet and Neumann conditions. In this paper, we prove the existence and uniqueness of a solution to this problem. The existence is proved by Schauder theorem and the uniqueness is obtained under more restricted conditions, when the involved operator is a contraction. Copyright © 2005 John Wiley & Sons, Ltd.     

Minimum Distance Between the Faces of Two Convex Polyhedra: A Sufficient Condition

The problem of finding the Euclidean distance between two convex polyhedra can be reduced to the combinatorial optimization problem of finding the minimum distance between their faces. This paper presents a global optimality criterion for this problem. An algorithm (QLDPA) for the fast computation of the distance between convex and bounded polyhedra is proposed as an application of it. Computer experiments show its fast performance, especially when the total number of vertices is large.     

Methods for implementing the stream boundary condition in DSMC computations

In the direct simulation Monte‐Carlo (DSMC) method for simulating rarefied gas flows, the velocities of simulator particles that cross a simulation boundary and enter the simulation space are typically generated using the acceptance–rejection procedure that samples the velocities from a truncated theoretical velocity distribution that excludes low and high velocities. This paper analyses an alternative technique, where the velocities of entering particles are obtained by extending the simulation procedures to a region adjacent to the simulation space, and considering the movement of particles generated within that region during the simulation time step. The alternative method may be considered as a form of acceptance–rejection procedure, and permits the generation of all possible velocities, although the population of high velocities is depleted with respect to the theoretical distribution. Nevertheless, this is an improvement over the standard acceptance–rejection method. Previous implementations of the alternative method gave a number flux lower than the theoretical number required. Two methods for obtaining the correct number flux are presented. For upstream boundaries in high‐speed flows, the alternative method is more computationally efficient than the acceptance–rejection method. However, for downstream boundaries, the alternative method is extremely inefficient. The alternative method, with the correct theoretical number flux, should therefore be used in DSMC computations in favour of the acceptance–rejection method for upstream boundaries in high‐speed flows. Copyright © 2003 John Wiley & Sons, Ltd.     

On the application of slip boundary condition on curved boundaries

Hydrodynamic simulations of sloshing phenomena often involve the application of slip boundary condition at the wetted surfaces. If these surfaces are curved, the ambiguous nature of the normal vector in the discretized problem can interfere with the application of such a boundary condition. Even the use of consistent normal vectors, preferred from the point of view of conservation, does not assure good approximation of the continuum slip condition in the discrete problem, and non‐physical recirculating flow fields may be observed. As a remedy, we consider the Navier slip condition, and more successfully, the so‐called BC‐free boundary condition. Copyright © 2004 John Wiley & Sons, Ltd.     

LINEAR ACTIVE STRUCTURES AND MODES (Ⅱ)--DISCRETE SYSTEMS AND BEAMS

The basic concepts about the active structures and some attributes of the modes were presented in paper "Liner Active Structures and Modes ( Ⅰ ) ". The characteristics of the active discrete systems and active beams were discussed, especially, the stability of the active structures and the orthogonality of the eigenvectors. The notes about modes were portrayed by a model of a seven-storeyed building with sensors and actuators. The concept of the adjoint active structure was extended from the discrete systems to the beams that were the representations of the continuous structures. Two types of beams with different placements of the measuring and actuating systems were discussed in detail. One is the beam with the discrete sensors and actuators, and the other is the beam with distributed sensor and actuator function. The orthogonality conditions were derived with the modal shapes of the active beam and its adjoint active beam. An example shows that the variation of eigenvalues with feedback amplitude for the homo-configuration and non-homo-configuration active structures.     

On a resolvent estimate of the Stokes equation with Neumann–Dirichlet‐type boundary condition on an infinite layer

This paper is concerned with the standard Lp estimate of solutions to the resolvent problem for the Stokes operator on an infinite layer with ‘Neumann–Dirichlet‐type’ boundary condition. Copyright © 2004 John Wiley & Sons, Ltd.     

On Optimality Condition for Vector Optimization Based on Convex Set-Valued Mapping

1.IntroductionTheoptimalityconditionsofmathematicalprogrammingisaveryimportantsubjectbecausetLeyprovideausefulanalyticaltoolforstudingthedualitytheoryandnonlinearprogrammingalgoirthms.Inrecelltyears,someauthorshavebeguntostudytheoptimalityconditionsforvectoroptimizationproblemofset-valuedmapping,suchas[4][51.Inthispaperlwedefinetheconceptofcone--weaklyefficientsubdifferentialofset-valuedmappinginthecaseofgeneralpartiallyorderedlocallyconvextopologicalvectorspaces.Thecone-weaklysubdifferential…     

Parallel Algorithm for Unconstrained Optimization Based on Decomposition Techniques

We present a numerical implementation of the parallel gradient distribution (PGD) method for the solution of large-scale unconstrained optimization problems. The proposed parallel algorithm is characterized by a parallel phase which exploits the portions of the gradient of the objective function assigned to each processor; then, a coordination phase follows which, by a synchronous interaction scheme, optimizes over the partial results obtained by the parallel phase. The parallel and coordination phases are implemented using a quasi-Newton limited-memory BFGS approach. The computational experiments, carried out on a network of UNIX workstations by using the parallel software tool PVM, show that parallelization efficiency was problem dependent and ranged between 0.15 and 8.75. For the 150 problems solved by PGD on more than one processor, 85 cases had parallelization efficiency below 1, while 65 cases had a parallelization efficiency above 1.     

Quadratic Functionals with General Boundary Conditions

The purpose of this paper is to give the Reid ``Roundabout Theorem' for quadratic functionals with general boundary conditions. In particular, we describe the so-called coupled point and regularity condition introduced in [16] in terms of Riccati equation solutions. Accepted 27 February 1996     

New Imperfect Conjugate Gradient Algorithm

We present a method which generates conjugate search directions and maintains the quadratic convergence property, when applied to a quadratic function, even when the line searches are not exact. The method is similar to that given by Dixon, but needs one less vector store. When the method is applied to a number of general functions of different dimensionality, results show the efficiency of the method.